Time complexity

Results: 894



#Item
41CS264: Beyond Worst-Case Analysis The Top 10 List∗ Tim Roughgarden† December 3, 2014 We covered a lot of concepts in this course. To appreciate this, let’s review the overarching narrative of the course via a top 1

CS264: Beyond Worst-Case Analysis The Top 10 List∗ Tim Roughgarden† December 3, 2014 We covered a lot of concepts in this course. To appreciate this, let’s review the overarching narrative of the course via a top 1

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2014-12-24 18:09:21
42Introduction to Algorithms Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis May 19, Spring 2011

Introduction to Algorithms Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis May 19, Spring 2011

Add to Reading List

Source URL: courses.csail.mit.edu

Language: English - Date: 2011-05-20 09:43:49
43. CS711008Z Algorithm Design and Analysis Lecture 5. Basic algorithm design technique: Divide-and-Conquer 1

. CS711008Z Algorithm Design and Analysis Lecture 5. Basic algorithm design technique: Divide-and-Conquer 1

Add to Reading List

Source URL: bioinfo.ict.ac.cn

Language: English - Date: 2016-03-29 21:49:55
44Trade-offs between Selection Complexity and Performance when Searching the Plane without Communication∗ Christoph Lenzen Nancy Lynch

Trade-offs between Selection Complexity and Performance when Searching the Plane without Communication∗ Christoph Lenzen Nancy Lynch

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2015-05-29 10:12:12
45Code generation for polynomial multiplication ´ Ling Ding1 and Eric Schost2 1

Code generation for polynomial multiplication ´ Ling Ding1 and Eric Schost2 1

Add to Reading List

Source URL: www.csd.uwo.ca

Language: English - Date: 2009-11-01 20:46:02
46Parameterized Proof Complexity∗ Stefan Dantchev, Barnaby Martin, and Stefan Szeider Department of Computer Science Durham University, Durham, England, UK [s.s.dantchev,b.d.martin,stefan.szeider]@durham.ac.uk

Parameterized Proof Complexity∗ Stefan Dantchev, Barnaby Martin, and Stefan Szeider Department of Computer Science Durham University, Durham, England, UK [s.s.dantchev,b.d.martin,stefan.szeider]@durham.ac.uk

Add to Reading List

Source URL: www.bedewell.com

Language: English - Date: 2009-11-10 10:56:36
47A PTAS for the Highway Problem Fabrizio Grandoni & Thomas Rothvo Institute of Mathemati s EPFL, Lausanne The Highway Problem

A PTAS for the Highway Problem Fabrizio Grandoni & Thomas Rothvo Institute of Mathemati s EPFL, Lausanne The Highway Problem

Add to Reading List

Source URL: www.math.washington.edu

Language: English - Date: 2013-11-01 17:11:36
48Energy-Efficient Algorithms for Flow Time Minimization Susanne Albers∗ Hiroshi Fujiwara† Topic classification: Algorithms and data structures

Energy-Efficient Algorithms for Flow Time Minimization Susanne Albers∗ Hiroshi Fujiwara† Topic classification: Algorithms and data structures

Add to Reading List

Source URL: www14.in.tum.de

Language: English - Date: 2013-11-25 11:02:45
49Bin Pa king via Dis repan y of Permutations F. Eisenbrand, D. Palv olgyi & T. Rothvo Cargese Workshop 2010

Bin Pa king via Dis repan y of Permutations F. Eisenbrand, D. Palv olgyi & T. Rothvo Cargese Workshop 2010

Add to Reading List

Source URL: www.math.washington.edu

Language: English - Date: 2013-11-01 17:11:36